A Low-rank Tensor Regularization Strategy for Hyperspectral Unmixing
نویسندگان
چکیده
Tensor-based methods have recently emerged as a more natural and effective formulation to address many problems in hyperspectral imaging. In hyperspectral unmixing (HU), low-rank constraints on the abundance maps have been shown to act as a regularization which adequately accounts for the multidimensional structure of the underlying signal. However, imposing a strict low-rank constraint for the abundance maps does not seem to be adequate, as important information that may be required to represent fine scale abundance behavior may be discarded. This paper introduces a new low-rank tensor regularization that adequately captures the low-rank structure underlying the abundance maps without hindering the flexibility of the solution. Simulation results with synthetic and real data show that the the extra flexibility introduced by the proposed regularization significantly improves the unmixing results.
منابع مشابه
Hyperspectral Image Mixed Noise Reduction Based on Improved K-svd Algorithm
We propose an algorithm for mixed noise reduction in Hyperspectral Imagery (HSI). The hyperspectral data cube is considered as a three order tensor. These tensors give a clear view about both spatial and spectral modes. The HSI provides ample spectral information to identify and distinguish spectrally unique materials, thus they are spectrally over determined. Tensor representation is three ord...
متن کاملHyperspectral Unmixing via Low-Rank Representation with Space Consistency Constraint and Spectral Library Pruning
Spectral unmixing is a popular technique for hyperspectral data interpretation. It focuses on estimating the abundance of pure spectral signature (called as endmembers) in each observed image signature. However, the identification of the endmembers in the original hyperspectral data becomes a challenge due to the lack of pure pixels in the scenes and the difficulty in estimating the number of e...
متن کاملTech Report: A Fast Multiscale Spatial Regularization for Sparse Hyperspectral Unmixing
Sparse hyperspectral unmixing from large spectral libraries has been considered to circumvent limitations of endmember extraction algorithms in many applications. This strategy often leads to ill-posed inverse problems, which can benefit from spatial regularization strategies. While existing spatial regularization methods improve the problem conditioning and promote piecewise smooth solutions, ...
متن کاملSemi-supervised Interactive Unmixing for Hyperspectral Image Analysis
In the past several decades, hyperspectral imaging has drawn a lot of attention in the field of remote sensing. Yet, due to low spatial resolutions of hyperspectral imagers, often the response from more than one surface material can be found in some hyperspectral pixels. These pixels are called mixed pixels. Mixed pixels bring challenges to traditional pixel-level applications, such as identifi...
متن کاملHyperspectral Unmixing from Incomplete and Noisy Data
In hyperspectral images, once the pure spectra of the materials are known, hyperspectral unmixing seeks to find their relative abundances throughout the scene. We present a novel variational model for hyperspectral unmixing from incomplete noisy data, which combines a spatial regularity prior with the knowledge of the pure spectra. The material abundances are found by minimizing the resulting c...
متن کامل